import math
import sys
import itertools
import fractions
if __name__ == '__main__':
wtf = sys.stdin.read()
wtf = wtf.strip().split('\n')
w,h = map(int, wtf[0].split())
u1,d1 = map(int, wtf[1].split())
u2,d2 = map(int, wtf[2].split())
for i in range(h,-1,-1):
w+=i
if d1 == i:
w-=u1
if d2 == i:
w-=u2
if w < 0:
w=0
print(0 if w < 0 else w)
#include <iostream>
#include <array>
#include <algorithm>
void solve()
{
int w, h;
std::cin >> w >> h;
std::array<std::pair<int, int>, 2> stones;
for(auto& e : stones)
std::cin >> e.first >> e.second;
for(int i = h; i > 0; --i)
{
w += i;
for(const auto stone : stones)
if(stone.second == i)
w = std::max(0, w - stone.first);
}
std::cout << w << '\n';
}
int main()
{
solve();
return EXIT_SUCCESS;
}
566. Reshape the Matrix | 167. Two Sum II - Input array is sorted |
387. First Unique Character in a String | 383. Ransom Note |
242. Valid Anagram | 141. Linked List Cycle |
21. Merge Two Sorted Lists | 203. Remove Linked List Elements |
733. Flood Fill | 206. Reverse Linked List |
83. Remove Duplicates from Sorted List | 116. Populating Next Right Pointers in Each Node |
145. Binary Tree Postorder Traversal | 94. Binary Tree Inorder Traversal |
101. Symmetric Tree | 77. Combinations |
46. Permutations | 226. Invert Binary Tree |
112. Path Sum | 1556A - A Variety of Operations |
136. Single Number | 169. Majority Element |
119. Pascal's Triangle II | 409. Longest Palindrome |
1574A - Regular Bracket Sequences | 1574B - Combinatorics Homework |
1567A - Domino Disaster | 1593A - Elections |
1607A - Linear Keyboard | EQUALCOIN Equal Coins |